Wishartness and independence of matrix quadratic forms in a normal random matrix
نویسندگان
چکیده
منابع مشابه
Distribution of matrix quadratic forms under skew-normal settings
For a class of skew-normal matrix distributions, the density function, moment generating function and independent conditions are obtained. The noncentral skew Wishart distribution is defined and the necessary and sufficient conditions under which a quadratic form is noncentral skew Wishart distributed random matrix are established. A new version of Cochran’s theorem is given. For illustration, ...
متن کاملOn the Distribution of Matrix Quadratic Forms
Martin Ohlson and Timo Koski, On the Distribution of Matrix Quadratic Forms, 2012, Communications in Statistics Theory and Methods, (41), 18, 3403-315. Communications in Statistics Theory and Methods is available online at informaworld TM : http://dx.doi.org/10.1080/03610926.2011.563009 Copyright: Taylor & Francis: STM, Behavioural Science and Public Health Titles / Taylor & Francis http://www....
متن کاملReduction and Normal Forms of Matrix Pencils
Matrix pencils, or pairs of matrices, may be used in a variety of applications. In particular, a pair of matrices (E,A) may be interpreted as the differential equation Ex′ + Ax = 0. Such an equation is invariant by changes of variables, or linear combination of the equations. This change of variables or equations is associated to a group action. The invariants corresponding to this group action...
متن کاملSmallest Reduction Matrix of Binary Quadratic Forms And Cryptographic Applications
We present a variant of the Lagrange-Gauss reduction of quadratic forms designed to minimize the norm of the reduction matrix within a quadratic complexity. The matrix computed by our algorithm on the input f has norm O f 1 2 Δ 4 f , which is the square root of the best previously known bounds using classical algorithms. This new bound allows us to fully prove the heuristic lattice based attack...
متن کاملParallel Algorithms for Matrix Normal Forms
Here we offer a new randomized parallel algorithm that determines the Smith normal form of a matrix with entries being univariate polynomials with coefficients in an arbitrary field. The algorithm has two important advantages over our previous one: the multipliers relating the Smith form to the input matrix are computed, and the algorithm is probabilistic of Las Vegas type, i.e., always finds t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Multivariate Analysis
سال: 2008
ISSN: 0047-259X
DOI: 10.1016/j.jmva.2007.01.012